Face Identification Based on K-Nearest Neighbor
نویسندگان
چکیده
منابع مشابه
Drought Monitoring and Prediction using K-Nearest Neighbor Algorithm
Drought is a climate phenomenon which might occur in any climate condition and all regions on the earth. Effective drought management depends on the application of appropriate drought indices. Drought indices are variables which are used to detect and characterize drought conditions. In this study, it was tried to predict drought occurrence, based on the standard precipitation index (SPI), usin...
متن کاملIdentification of selected monogeneans using image processing, artificial neural network and K-nearest neighbor
Abstract Over the last two decades, improvements in developing computational tools made significant contributions to the classification of biological specimens` images to their correspondence species. These days, identification of biological species is much easier for taxonomist and even non-taxonomists due to the development of automated computer techniques and systems. In this study, we d...
متن کاملFast Approximate Nearest-Neighbor Search with k-Nearest Neighbor Graph
We introduce a new nearest neighbor search algorithm. The algorithm builds a nearest neighbor graph in an offline phase and when queried with a new point, performs hill-climbing starting from a randomly sampled node of the graph. We provide theoretical guarantees for the accuracy and the computational complexity and empirically show the effectiveness of this algorithm.
متن کاملSpectral Clustering Based on k-Nearest Neighbor Graph
Finding clusters in data is a challenging task when the clusters differ widely in shapes, sizes, and densities. We present a novel spectral algorithm Speclus with a similarity measure based on modified mutual nearest neighbor graph. The resulting affinity matrix reflex the true structure of data. Its eigenvectors, that do not change their sign, are used for clustering data. The algorithm requir...
متن کاملA Semi-Supervised Approach Based on k-Nearest Neighbor
k-nearest neighbor (k-NN) needs sufficient labeled instances for training in order to get robust performance; otherwise, performance deterioration occurs if training sets are small. In this paper, a novel algorithm, namely ordinal semi-supervised k-NN, is proposed to handle cases with a few labeled training instances. This algorithm consists of two parts: instance ranking and semi-supervised le...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Scientific Journal of Informatics
سال: 2019
ISSN: 2460-0040,2407-7658
DOI: 10.15294/sji.v6i2.19503